A Heuristic for Improved Genetic Bin Packing

نویسندگان

  • Arthur L CORCORAN
  • Roger L WAINWRIGHT
چکیده

The bin packing optimization problem packs a set of objects into a set of bins so that the amount of wasted space is minimized The bin packing problem has many important applications These include multiprocessor scheduling resource allocation and real world planning packing routing and scheduling optimization problems The bin packing problem is NP complete Since there is therefore little hope in nding an e cient deterministic solution to the bin packing problem approximation methods have been developed The advantage of these methods is that they have guaranteed packing performance bounds A survey of approximation algorithms for bin packing and their respective performance bounds are reported by Garey and Johnson in the one dimensional case Co man et al in the two dimensional case and Li and Cheng in the three dimensional case In many practical applications of bin packing a small improvement in packing e ciency can result in great cost savings For example when a bin represents a truck ship or airplane a large sum of money can be saved by using one less bin Genetic algorithms have been used on the bin packing problem with great success A genetic algorithm is an iterative procedure which borrows the ideas of natural selection and survival of the ttest from natural evolution By simulating natural evolution in this way a genetic algo rithm can easily solve complex problems Furthermore by emulating biological selection and reproduction techniques a genetic algorithm can e ectively search the problem domain in a general representation in dependent manner The genetic algorithm maintains a population of chromosomes which represent points in the problem domain Each chromosome is evaluated by a user de ned objective function The genetic algorithm relys on operators such as reproduction crossover and mutation to evolve from one generation to the next Reproduction ensures the ttest chromosome will survive Crossover and mutation alter the chromosomes so that new points in the solution space are explored

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

Comparison of Meta-Heuristic Algorithms for Clustering Rectangles

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

متن کامل

A genetic programming hyper-heuristic approach to automated packing

This thesis presents a programme of research which investigated a genetic programming hyper-heuristic methodology to automate the heuristic design process for one, two and three dimensional packing problems. Traditionally, heuristic search methodologies operate on a space of potential solutions to a problem. In contrast, a hyper-heuristic is a heuristic which searches a space of heuristics, rat...

متن کامل

Evolving Bin Packing Heuristics with Genetic Programming

The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heuristics have been developed to generate good quality solutions. This paper outlines a genetic programming system which evolves a heuristic that decides whether to put a piece in a bin when presented with the sum of the pieces already in the bin and the size of the piece that is about to be packed....

متن کامل

A Genetic Algorithm for 2D Glass Cutting Problem

A Genetic algorithm is a heuristic approach which applies analogies from nature to tackle complex optimization problems. Existing solutions (the ancestors) are randomly modified to produce offsprings which might replace their parents. We apply a genetic algorithm to a special case of a 2D bin packing problem, using a permutation-style representation decoded by a modified first-fit heuristic

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993